Embedding complete ternary trees into hypercubes

Embedding of Complete and Nearly Complete Binary Trees into Hypercubes

A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented.

On Embedding Ternary Trees into Boolean Hypercubes

Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

We study the embedding problem of enhanced and augmented hypercubes into complete binary trees. Using tree traversal techniques, we compute minimum average edge-congestion of enhanced and augmented hypercubes into complete binary trees.

Embedding of Hypercubes into Complete Binary Trees

We estimate and characterize the edge congestion-sum measure for embeddings of hypercubes into complete binary trees. Our algorithms produce optimal values of sum of edge-congestions in linear time.

Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes

The double-rooted complete binary tree is a complete binary tree where the path (of length ) between the children of the root is replaced by a path of length . It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into the hypercube does not pr...